Efficient Processing of Regular Queries over Xml Data Sets Using Structural Indexes
نویسندگان
چکیده
منابع مشابه
Efficient Processing of XPath Queries Using Indexes
A number of query languages have been proposed in recent times for processing queries on XML and semistructured data. All these query languages make use of regular path expressions to query XML data. To optimize the processing of query paths a number of indexing schemes have also been proposed recently. XPath provides the basis for processing queries on XML data in the form of regular path expr...
متن کاملEfficient Processing Regular Queries In Shared-Nothing Parallel Database Systems Using Tree- And Structural Indexes
In this paper, we introduce and study an efficient regular queries processing algorithm on a very large XML data set which is fragmented and stored on different machines. The machines are connected by the high speed interconnection. In this system the efficiency of a query processing algorithm depends on two main factors: the waiting time for the answer and the total query processing and commun...
متن کاملAn Efficient Index Lattice for XML Query Optimization
Structural indexes of XML data can effectively reduce the search space for the evaluation of path queries over the data. The indexes partition the structural graph of an XML document into equivalent classes of nodes that are then condensed into index nodes. However, structural indexes are inadequate to handle queries with valuebased conditions, since equivalent nodes in the same partition becom...
متن کاملAn adaptive path index for XML data using the query workload
Due to its flexibility, XML is becoming the de facto standard for exchanging and querying documents over the Web. Many XML query languages such as XQuery and XPath use label paths to traverse the irregularly structured XML data. Without a structural summary and efficient indexes, query processing can be quite inefficient due to an exhaustive traversal on XML data. To overcome the inefficiency, ...
متن کاملPractical Indexing XML Document for Twig Query
Answering structural queries of XML with index is an important approach of efficient XML query processing. Among existing structural indexes for XML data, F&B index is the smallest index that can answer all branching queries. However, an F&B index for less regular XML data often contains a large number of index nodes, and hence a large amount of main memory. If the F&B index cannot be accommoda...
متن کامل